def quicksort(arr):
	if len(arr) < 2:
		return arr
	else:
		pivot = arr[0]
		less = [ i for i in arr[1:] if i <= pivot ]
		greater = [i for i in arr[1:] if i > pivot]
		return quicksort(less) + [pivot] + quicksort(greater)

test = [1,3,21,431,43,215,4,5,4323,5,326,5436,54,7,658,78,9]

print(quicksort(test))
